Efficiency of Selected Meta-heuristics Applied to the Tsp Problem: a Simulation Study
نویسندگان
چکیده
The paper presents a simulation study of the usefulness of a number of meta-heuristics used as optimisation methods for TSP problems. The five considered approaches are outlined: Genetic Algorithm, Simulated Annealing, Ant Colony System, Tabu Search and Hopfield Neural Network. Using a purpose-developed computer program, efficiency of the meta-heuritics has been studied and compared. Results obtained from about 40000 simulation runs are briefly presented and discussed.
منابع مشابه
Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملHeuristic Approaches to Solve Traveling Salesman Problem
This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why different heuristics are generally applied to solve TSP. Heuristics to solve TSP are presented here with...
متن کاملNew Approaches in Meta-heuristics to Schedule Purposeful Inspections of Workshops in Manufacturing Supply Chains
Nowadays, with the growth of technology and the industrialization of societies, work-related accidents, and consequently the threat of human capital and material resources are among the problems of the countries of the world. The most important legal solution in most countries to control occupational accidents and illnesses is to conduct periodic site visits and identify hazardous sites. To the...
متن کاملComparing Three Proposed Meta-heuristics to Solve a New p-hub Location-allocation Problem
This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کامل